Fixpoint alternation: arithmetic, transition systems, and the binary tree
نویسندگان
چکیده
منابع مشابه
Fixpoint alternation: Arithmetic, transition systems, and the binary tree
We provide an elementary proof of the fixpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mu-calculus alternation hierarchy. We further show that the alternation hierarchy on the binary tree is strict, resolving a problem of Niwiński.
متن کاملFixpoint alternation and the Wadge hierarchy
In [2] Bradfield found a link between finite differences formed by Σ2 sets and the mu-arithmetic introduced by Lubarski [10]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ2 sets. The difference hierarchy is intimately related to parity games. When passing...
متن کاملBinary Tree Arithmetic with Generalized Constructors
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of natural numbers. Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. I...
متن کاملAlternation Is Strict For Higher-Order Modal Fixpoint Logic
We study the expressive power of Alternating Parity Krivine Automata (APKA), which provide operational semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinary parity automata extended by a variation of the Krivine Abstract Machine. We show that the number and parity of priorities available to an APKA form a proper hierarchy of expressive power as in the modal μ-calculus. ...
متن کاملAn Adaptive Binary Arithmetic Coder Using a State Transition Table
We propose a fast and simple binary arithmetic coder, STT-coder, in which arithmetic operation of dividing the probability interval can be done using a state transition table. In order to simplify the state transition table by omitting to retain the both of the bottom address of the valid interval and renormalized interval, renormalization is mostly executed together with the flush operation of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1999
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:1999122